#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
multiset<int> st;
int a[N];
signed main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	int n,ans=0;
	scanf("%d",&n);
	for (int i=1;i<=n;++i)
		scanf("%d",a+i),st.insert(a[i]);
    sort(a+1,a+n+1);
    for (int i=1;i<=n;++i){
        auto p=st.upper_bound(a[i]);
        if (p==st.end()) break;
        ++ans,st.erase(p);
    }
	printf("%d",n-ans);
	return 0;
}
